منابع مشابه
Certified Higher-Order Recursive Path Ordering
Recursive path ordering (RPO) is a well-known reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higher-order case thus creating the higher-order recursive path ordering (HORPO) [8]. They proved that this ordering can be used for proving termination of higher-order TRSs wh...
متن کاملThe Higher-Order Recursive Path Ordering
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed lambda-calculus generated by a signature of polymorphic higher-order function symbols. The obtained ordering is well-founded, compatible with -reductions and with polymorphic typing, monotonic with respect to the funct...
متن کاملAutomation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in...
متن کاملRecursive Path Ordering for Infinite Labelled Rewrite Systems
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in...
متن کاملA Constructive Axiomatization of the Recursive Path Ordering
Résumé We give an axiomatization of Recursive Path Orders in the Calculus of Inductive Constructions. Then, we show that they are monotonic strict partial orders, and that they are well-founded. The proof of the well-foundedness is particularly short and elementary. Finally, we produce three relations that are proved to model the axiomatization: the Multiset Path Ordering, the Lexicographic Pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90175-6